Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
51	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2003-12-08 11:12:51 Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction
52	Publications Daniel Merkle Submitted [FFM+ 13] Fagerberg, R., C. Flamm, D. Merkle, P. Peters and P.F. Stadler: On the Complexity of Reconstructing Chemical Reaction Networkssubmitted. Books [BM11] Blum, C. and D. Add to Reading List Source URL: www.imada.sdu.dk Language: English - Date: 2013-09-06 03:51:46 Evolution Academia Cybernetics Aquatic ecology Behavior Swarm behaviour Zoology Ant colony optimization algorithms Evolutionary computation Lecture Notes in Computer Science Swarm intelligence Algorithmic Number Theory Symposium
53	Structural Recursion as a Query Language y Val Breazu-Tannen, Peter Buneman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104{6389, USA val, peter @cis.upenn.edu Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-12-31 07:06:16 Mathematics Algebra Mathematical logic Relational model Models of computation Logic in computer science Database theory Lambda calculus Relational algebra Tuple Finitary relation Combinatory logic
54	ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P
55	553 Documenta Math. A Modular Compactification of the General Linear Group Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2001-01-17 12:27:51 Mathematics Ordinal number Wellfoundedness Constructible universe Symbol Closed and exact differential forms Theory of computation NC CurryHoward correspondence Generalised Whitehead product
56	MPC vs. SFE: Perfect Security in a Unified Corruption Model ? Zuzana Beerliov´a-Trub´ıniov´a, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas Department of Computer Science, ETH Zurich {bzuzana,fitzi,hir Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2011-02-19 14:29:40 Cryptography Secure multi-party computation Secure two-party computation Ciphertext indistinguishability Consensus Secret sharing IP Control theory
57	Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:57 Computational complexity theory Theory of computation Analysis of algorithms Operations research Scheduling Algorithm Mathematical logic Theoretical computer science Time complexity NC Job shop scheduling
58	Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:31 Analysis of algorithms Computational complexity theory Theory of computation Mathematics Balls into bins With high probability Sorting algorithm Leader election Time complexity Entropy Best worst and average case Big O notation
59	Gossip-Based Computation of Aggregate Information David Kempe∗, Alin Dobra, and Johannes Gehrke† Department of Computer Science, Cornell University Ithaca, NY 14853, USA {kempe,dobra,johannes}@cs.cornell.edu Abstract Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2007-10-12 00:29:55 Graph theory Computing Mathematics Distributed data storage Stochastic processes Network theory Networks Chord Gossip protocol Rope Random walk Maximal independent set
60	Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2 Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2006-08-23 14:28:28 Mathematics Graph theory Discrete mathematics NP-complete problems Graph coloring Algebra Recurrence relation Theory of computation Number theory Algorithm Independent set Mathematical induction